Efficient Mining of Length-Maximal Flock Patterns from Large Trajectory Data

نویسندگان

  • Xiaoliang Geng
  • Takeaki Uno
  • Hiroki Arimura
چکیده

In this paper, we study the problem of mining a class of spatio-temporal patterns, called flock patterns, which represent a groups of moving objects close each other in a given time segment (Gudmundsson and van Kreveld, Proc. ACM GIS’06; Benkert, Gudmundsson, Hubner, Wolle, Computational Geometry, 41:11, 2008). Based on frequent-pattern mining approach, such as Apriori, Eclat, or LCM, we present an efficient depth-first mining algorithm that finds all maximally longest flock patterns appearing in a collection of trajectory data in polynomial time per pattern using polynomial space, without using table-lookup. We also present a geometic pruning technique which significantly improves the efficiency of the algorithm very much.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Mining of Closed Flock Patterns from Large Trajectory Data

In this paper, we study the closed pattern mining problem for a class of spatio-temporal patterns, called closed (k, r)-flock patterns in trajectory databases. A (k, r)-flock pattern (Gudmundsson and van Kreveld, 2006) represents a set of moving objects traveling close each other within radius r during time period of length k. Based on the notion of the envelope for a flock pattern, we introduc...

متن کامل

Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories

In this paper, we implement recent theoretical progress of depth-first algorithms for mining flock patterns (Arimura et al., 2013) based on depth-first frequent itemset mining approach, such as Eclat (Zaki, 2000) or LCM (Uno et al., 2004). Flock patterns are a class of spatio-temporal patterns that represent a groups of moving objects close each other in a given time segment (Gudmundsson and va...

متن کامل

New Methods for Mining Sequential and Time Series Data

Data mining is the process of extracting knowledge from large amounts of data. It covers a variety of techniques aimed at discovering diverse types of patterns on the basis of the requirements of the domain. These techniques include association rules mining, classification, cluster analysis and outlier detection. The availability of applications that produce massive amounts of spatial, spatio-t...

متن کامل

Mining moving flock patterns in large spatio-temporal datasets using a frequent pattern mining approach

Modern data acquisition techniques such as Global positioning system (GPS),Radio-frequency identification (RFID) and mobile phones have resulted in thecollection of huge amounts of data in the form of trajectories during the pastyears. Popularity of these technologies and ubiquity of mobile devices seemto indicate that the amount of spatio-temporal data will increase at accel-<l...

متن کامل

Efficient Algorithms to Discover Flock Patterns in Trajectories

With the ubiquitous use of location enabled devices, pattern discovery in trajectories has been receiving increasing interest. Among such patterns, we have queries related to how groups of moving objects behave over time such as discovering flocks. A flock pattern is defined as a set of moving objects that move within a predefined distance to each other for a given continuous period of time. A ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013